deterministic decision造句

Deterministic decision trees also require exponential size to detect cliques, or large polynomial size to detect cliques of bounded size.
However, for deterministic decision trees, and for any in the range, the property of containing a-clique was shown to have decision tree complexity exactly by.
Because the property of containing a clique is monotone, it is covered by the Aanderaa Karp Rosenberg conjecture, which states that the deterministic decision tree complexity of determining any non-trivial monotone graph property is exactly.
It's difficult to find deterministic decision in a sentence. 用deterministic decision造句挺难的